#include <stdio.h>
#include "BinarySearchTree.h"

int main()
{
	node* root = 0;
	BinarySearchTree::Instance()->CreateTree(root, 12);			
	BinarySearchTree::Instance()->InOrder(root);	
	printf("\n");
	BinarySearchTree::Instance()->IterInOrder(root);
	printf("\n");

	BinarySearchTree::Instance()->PreOrder(root);
	printf("\n");
	BinarySearchTree::Instance()->IterPreOrder(root);
	printf("\n");

	BinarySearchTree::Instance()->PostOrder(root);	
	printf("\n");

	int depth = BinarySearchTree::Instance()->Depth(root);
	printf("depth:%d\n", depth);

	bool balanced = BinarySearchTree::Instance()->IsBalanced(root, depth);
	printf("isbalanced:%d\n", balanced);
}
